Unfolding Recursive Function Definitions Using the Paradoxical Combinator
Stephen Fitzpatrick, M. Clint, P. Kilpatrick 1 April 1996 Department of Computer Science, The Queen’s University of Belfast, Belfast BT7 1NN, N

Source URL: www.kestrel.edu

Inductive and Coinductive Data Types in Typed Lambda Calculus Revisited Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Type theory
• Computability theory
• Functional programming
• Theoretical computer science
• Recursion
• Initial algebra
• Lambda calculus
• Primitive recursive function
• Inductive type
• Catamorphism
• F-algebra

On the definition of the δˆ function ˆ x). We write q.a instead of δ(q, a) and q.x instead of δ(q, The text book presents the following recursive definition (1)

Source URL: www.cse.chalmers.se

FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 111–122 Connections Between a Family of Recursive Polynomials and Parking Function Theory

Source URL: www.math.nagoya-u.ac.jp

A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2 1 Department

Source URL: www.paultaylor.eu

• Theoretical computer science
• Theory of computation
• Functions and mappings
• Function
• Computable function
• Algorithm characterizations
• Primitive recursive function
• Mathematics
• Computability theory
• Mathematical logic

Recursive Session Types Revisited Ornela Dardha∗ School of Computing Science, University of Glasgow, UK Session types model structured communication-based programming. In particular, binary

Source URL: www.dcs.gla.ac.uk

• Computability theory
• Process calculi
• Π-calculus
• Theory of computation
• Function
• Valuation
• Logarithm
• Μ operator
• Primitive recursive function
• Mathematics
• Theoretical computer science
• Functions and mappings

Lowness Properties and Approximations of the Jump Santiago Figueira ∗

Source URL: www.glyc.dc.uba.ar

• Theoretical computer science
• Mathematical logic
• Theory of computation
• Recursion
• Primitive recursive function
• Function
• Μ operator
• Fixed-point combinator
• Mathematics
• Computability theory
• Functions and mappings

Randomness and Universal Machines Santiago Figueira∗ Frank Stephan† Guohua Wu‡

Source URL: www.glyc.dc.uba.ar

• Computer science
• Turing machine
• Formal methods
• Models of computation
• Turing degree
• Recursively enumerable set
• Computability
• Μ-recursive function
• Lambda calculus
• Computability theory
• Theoretical computer science
• Theory of computation

1993 Paper 6 Question 10 Computation Theory Explain what is meant by the following: ‘F is a recursively enumerable set each of whose elements is a total recursive function f : N → N.’

Source URL: www.cl.cam.ac.uk

COMPUTER SCIENCE TRIPOS Part IB – 2014 – Paper 3 5 Compiler Construction (TGG) Functional programmers will often rewrite a recursive function such as fun fact1 n =

Source URL: www.cl.cam.ac.uk